Reducing the number of variables in integer quadratic programming problem
نویسندگان
چکیده
منابع مشابه
Parameterized Integer Quadratic Programming: Variables and Coefficients
In the Integer Quadratic Programming problem input is an n× n integer matrix Q, an m × n integer matrix A and an m-dimensional integer vector b. The task is to find a vector x ∈ Z minimizing xQx, subject to Ax ≤ b. We give a fixed parameter tractable algorithm for Integer Quadratic Programming parameterized by n+α. Here α is the largest absolute value of an entry of Q and A. As an application o...
متن کاملDetermining the Optimal Value Bounds of the Objective Function in Interval Quadratic Programming Problem with Unrestricted Variables in Sign
In the most real-world applications, the parameters of the problem are not well understood. This is caused the problem data to be uncertain and indicated with intervals. Interval mathematical models include interval linear programming and interval nonlinear programming problems.A model of interval nonlinear programming problems for decision making based on uncertainty is interval quadratic prog...
متن کاملRewriting integer variables into zero-one variables: Some guidelines for the integer quadratic multi-knapsack problem
This paper is concerned with the integer quadratic multidimensional knapsack problem (QMKP) where the objective function is separable. Our objective is to determine which expansion technique of the integer variables is the most appropriate to solve (QMKP) to optimality using the upper bound method proposed by Quadri et al. (2007). To the best of our knowledge the upper bound method previously m...
متن کاملNew bounds on the unconstrained quadratic integer programming problem
We consider the maximization γ = max{xTAx : x ∈ {−1, 1}n} for a given symmetric A ∈ Rn×n . It was shown recently, using properties of zonotopes and hyperplane arrangements, that in the special case that A has a small rank, so that A = V V T where V ∈ Rn×m with m < n, then there exists a polynomial time algorithm (polynomial in n for a given m) to solve the problem max{xT V V T x : x ∈ {−1, 1}n}...
متن کاملReducing quadratic programming problem to regression problem: Stepwise algorithm
Quadratic programming is concerned with minimizing a convex quadratic function subject to linear inequality constraints. The variables are assumed to be nonnegative. The unique solution of quadratic programming (QP) problem (QPP) exists provided that a feasible region is non-empty (the QP has a feasible space). A method for searching for the solution to a QP is provided on the basis of statisti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2010
ISSN: 0307-904X
DOI: 10.1016/j.apm.2009.06.029